Methods and systems for effecting video transitions represented by bitmaps

ABSTRACT

Multi-media project editing methods and systems are described. In one embodiment, a project editing system comprises a multi-media editing application that is configured to enable a user to combine multiple different video clips into a video project. A bitmap processor coupled with the multi-media editing application receives a first bitmap that can be used to render a transition between video clips and automatically processes the first bitmap to provide a different transition between video clips. Processing of the first bitmap can include, without limitation, using the first bitmap to provide an entirely new and different second bitmap, or processing the first bitmap in a manner which renders a transition that is different from the transition defined by the first bitmap. In one embodiment, a user is able to enter one or more parameters, through a user interface (UI), with the parameters then being used to manipulate the first bitmap to provide the different transition. Processing of the first bitmap can include many different operations, among which can be included one or more of: stretching, shrinking, replication, and offsetting. In addition, the first bitmap can be processed to include, in the transition it defines, a border that is not otherwise defined by the first bitmap.

TECHNICAL FIELD

[0001] This invention generally relates to processing media content and, more particularly, to a system and related interfaces facilitating the processing of media content.

BACKGROUND

[0002] Recent advances in computing power and related technology have fostered the development of a new generation of powerful software applications. Gaming applications, communications applications, and multimedia applications have particularly benefited from increased processing power and clocking speeds. Indeed, once the province of dedicated, specialty workstations, many personal computing systems now have the capacity to receive, process and render multimedia objects (e.g., audio and video content). While the ability to display (receive, process and render) multimedia content has been around for a while, the ability for a standard computing system to support true multimedia editing applications is relatively new.

[0003] In an effort to satisfy this need, Microsoft Corporation introduced an innovative development system supporting advanced user-defined multimedia editing functions. An example of this architecture is presented in U.S. Pat. No. 5,913, 038 issued to Griffiths and commonly owned by the assignee of the present invention, the disclosure of which is expressly incorporated herein by reference.

[0004] In the '038 patent, Griffiths introduced the an application program interface which, when exposed to higher-level development applications, enables a user to graphically construct a multimedia processing project by piecing together a collection of “filters” exposed by the interface. The interface described therein is referred to as a filter graph manager. The filter graph manager controls the data structure of the filter graph and the way data moves through the filter graph. The filter graph manager provides a set of component object model (COM) interfaces for communication between a filter graph and its application. Filters of a filter graph architecture are preferably implemented as COM objects, each implementing one or more interfaces, each of which contains a predefined set of functions, called methods. Methods are called by an application program or other component objects in order to communicate with the object exposing the interface. The application program can also call methods or interfaces exposed by the filter graph manager object.

[0005] Filter graphs work with data representing a variety of media (or non-media) data types, each type characterized by a data stream that is processed by the filter components comprising the filter graph. A filter positioned closer to the source of the data is referred to as an upstream filter, while those further down the processing chain is referred to as a downstream filter. For each data stream that the filter handles it exposes at least one virtual pin (i.e., distinguished from a physical pin such as one might find on an integrated circuit). A virtual pin can be implemented as a COM object that represents a point of connection for a unidirectional data stream on a filter. Input pins represent inputs and accept data into the filter, while output pins represent outputs and provide data to other filters. Each of the filters include at least one memory buffer, wherein communication of the media stream between filters is often accomplished by a series of “copy” operations from one filter to another.

[0006] As introduced in Griffiths, a filter graph has three different types of filters: source filters, transform filters, and rendering filters. A source filter is used to load data from some source; a transform filter processes and passes data; and a rendering filter renders data to a hardware device or other locations (e.g., saved to a file, etc.). An example of a filter graph for a simplistic media rendering process is presented with reference to FIG. 1.

[0007]FIG. 1 graphically illustrates an example filter graph for rendering media content. As shown, the filter graph 100 is comprised of a plurality of filters 102-114, which read, process (transform) and render media content from a selected source file. As shown, the filter graph includes each of the types of filters described above, interconnected in a linear fashion.

[0008] Products utilizing the filter graph have been well received in the market as it has opened the door to multimedia editing using otherwise standard computing systems. It is to be appreciated, however, that the construction and implementation of the filter graphs are computationally intensive and expensive in terms of memory usage. Even the most simple of filter graphs requires and abundance of memory to facilitate the copy operations required to move data between filters. Complex filter graphs can become unwieldy, due in part to the linear nature of prior art filter graph architecture. Moreover, it is to be appreciated that the filter graphs themselves consume memory resources, thereby compounding the issue introduced above.

[0009] Thus, what is required is a filter graph architecture which reduces the computational and memory resources required to support even the most complex of multimedia projects. Indeed, what is required is a dynamically reconfigurable multimedia editing system and related methods, unencumbered by the limitations described above. Just such a system and methods are disclosed below.

SUMMARY

[0010] Multi-media project editing methods and systems are described. In one embodiment, a project editing system comprises a multi-media editing application that is configured to enable a user to combine multiple different video clips into a video project. A bitmap processor coupled with the multi-media editing application receives a first bitmap that can be used to render a transition between video clips and automatically processes the first bitmap to provide a different transition between video clips. Processing of the first bitmap can include, without limitation, using the first bitmap to provide an entirely new and different second bitmap, or processing the first bitmap in a manner which renders a transition that is different from the transition defined by the first bitmap. In one embodiment, a user is able to enter one or more parameters, through a user interface (UI), with the parameters then being used to manipulate the first bitmap to provide the different transition. Processing of the first bitmap can include many different operations, among which can be included one or more of: stretching, shrinking, replication, and offsetting. In addition, the first bitmap can be processed to include, in the transition it defines, a border that is not otherwise defined by the first bitmap.

BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The same reference numbers are used throughout the figures to reference like components and features.

[0012]FIG. 1 is a graphical representation of a conventional filter graph representing a user-defined development project.

[0013]FIG. 2 is a block diagram of a computing system incorporating the teachings of the described embodiment.

[0014]FIG. 3 is a block diagram of an example software architecture incorporating the teachings of the described embodiment.

[0015]FIG. 4 is a graphical illustration of an example software-enabled matrix switch, according to an exemplary embodiment.

[0016]FIG. 5 is a graphical representation of a data structure comprising a programming grid to selectively couple one or more of a scalable plurality of input pins to a scalable plurality of output pins of the matrix switch filter, in accordance with one aspect of the described embodiment.

[0017]FIG. 6 is a graphical illustration denoting shared buffer memory between filters, according to one aspect of the described embodiment.

[0018]FIG. 7 is a flow chart of an example method for generating a filter graph, in accordance with one aspect of the described embodiment.

[0019]FIG. 8 is a flow chart of an example method for negotiating buffer requirements between at least two adjacent filters, according to one aspect of the described embodiment.

[0020]FIG. 9 graphically illustrates an overview of a process that takes a user-defined editing project and composites a data structure that can be used to program the matrix switch.

[0021]FIG. 10 graphically illustrates the project of FIG. 9 in greater detail.

[0022]FIG. 11 shows an exemplary matrix switch dynamically generated in support of the project developed in FIGS. 9 and 10, according to one described embodiment.

[0023]FIG. 12 illustrates a graphic representation of an exemplary data structure that represents the project of FIG. 10, according to one described embodiment.

[0024] FIGS. 13-18 graphically illustrate various states of a matrix switch programming grid at select points in processing the project of FIGS. 9 and 10 through the matrix switch, in accordance with one described embodiment.

[0025]FIG. 19 is a flow chart of an example method for processing media content, in accordance with one described embodiment.

[0026]FIG. 20 illustrates an example project with a transition and an effect, in accordance with one described embodiment.

[0027]FIG. 21 shows an exemplary data structure in the form of a hierarchical tree that represents the project of FIG. 20.

[0028]FIGS. 22 and 23 graphically illustrate an example matrix switch programming grid associated with the project of FIG. 20 at select points in time, according to one described embodiment.

[0029]FIG. 24 shows an example matrix switch dynamically generated and configured as the grid of FIGS. 22 and 23 was being processed, in accordance with one described embodiment.

[0030]FIG. 25 shows an exemplary project in accordance with one described embodiment.

[0031]FIG. 26 graphically illustrates an example audio editing project, according to one described embodiment.

[0032]FIG. 27 depicts an example matrix switch programming grid associated with the project of FIG. 26.

[0033]FIG. 28 shows an example matrix switch dynamically generated and configured in accordance with the programming grid of FIG. 27 to perform the project of FIG. 26, according to one described embodiment.

[0034]FIG. 29 illustrates an exemplary media processing project incorporating another media processing project as a composite, according to yet another described embodiment.

[0035]FIG. 30 graphically illustrates an example data structure in the form of a hierarchical tree structure that represents the project of FIG. 29.

[0036] FIGS. 31-36 graphically illustrate various matrix switch programming grid states at select points in generating and configuring the matrix switch to implement the media processing of FIG. 29.

[0037]FIG. 38 illustrates an example matrix switch suitable for use in the media processing project of FIG. 29, according to one described embodiment.

[0038]FIG. 38a graphically illustrates an example data structure in the form of a hierarchical tree structure that represents a project that is useful in understanding composites in accordance with the described embodiments.

[0039]FIG. 39 is a flow diagram that describes steps in a method in accordance with one described embodiment.

DETAILED DESCRIPTION

[0040] Related Applications

[0041] This application is related to the following commonly-filed U.S. Patent Applications, all of which are commonly assigned to Microsoft Corp., the disclosures of which are incorporated by reference herein:

[0042] application Ser. No. ______, entitled “An Interface and Related Methods for Reducing Source Accesses in a Development System”, naming Daniel J. Miller and Eric H. Rudolph as inventors, and bearing attorney docket number MS1-643US;

[0043] application Ser. No. ______, entitled “A System and Related Interfaces Supporting the Processing of Media Content”, naming Daniel J. Miller and Eric H. Rudolph as inventors, and bearing attorney docket number MS1-629US;

[0044] application Ser. No. ______, entitled “A System and Related Methods for Reducing Source Filter Invocation in a Development Project”, naming Daniel J. Miller and Eric H. Rudolph as inventors, and bearing attorney docket number MS1-631US;

[0045] application Ser. No. ______,entitled “A System and Related Methods for Reducing Memory Requirements of a Media Processing System”, naming Daniel J. Miller and Eric H. Rudolph as inventors, and bearing attorney docket number MS 1-632US;

[0046] application Ser. No. ______, entitled “A System and Related Methods for Reducing the Instances of Source Files in a Filter Graph”, naming Daniel J. Miller and Eric H. Rudolph as inventors, and bearing attorney docket number MS 1-633US;

[0047] application Ser. No. ______, entitled “An Interface and Related Methods for Dynamically Generating a Filter Graph in a Development System”, naming Daniel J. Miller and Eric H. Rudolph as inventors, and bearing attorney docket number MS1-634US;

[0048] application Ser. No. ______, entitled “A System and Related Methods for Processing Audio Content in a Filter Graph”, naming Daniel J. Miller and Eric H. Rudolph as inventors, and bearing attorney docket number MS 1-639US;

[0049] application Ser. No. ______, entitled “A System and Methods for Generating an Managing Filter Strings in a Filter Graph”, naming Daniel J. Miller and Eric H. Rudolph as inventors, and bearing attorney docket number MS 1-642US;

[0050] application Ser. No. ______, entitled “Methods and Systems for Processing Media Content”, naming Daniel J. Miller and Eric H. Rudolph as inventors, and bearing attorney docket number MS1-640US;

[0051] application Ser. No. ______, entitled “Systems for Managing Multiple Inputs and Methods and Systems for Processing Media Content ”, naming Daniel J. Miller and Eric H. Rudolph as inventors, and bearing attorney docket number MS 1-63 5US;

[0052] application Ser. No. ______, entitled “Methods and Systems for Implementing Dynamic Properties on Objects that Support Only Static Properties”, naming Daniel J. Miller and David Maymudes as inventors, and bearing attorney docket number MS1-638US;

[0053] application Ser. No. ______, entitled “Methods and Systems for Efficiently Processing Compressed and Uncompressed Media Content”, naming Daniel J. Miller and Eric H. Rudolph as inventors, and bearing attorney docket number MS 1-630US;

[0054] application Ser. No. ______, entitled “Methods and Systems for Effecting Video Transitions Represented By Bitmaps”, naming Daniel J. Miller and David Maymudes as inventors, and bearing attorney docket number MS 1-637US;

[0055] application Ser. No. ______, entitled “Methods and Systems for Mixing Digital Audio Signals”, naming Eric H. Rudolph as inventor, and bearing attorney docket number MS1-636US; and

[0056] application Ser. No. ______, entitled “Methods and Systems for Processing Multi-media Editing Projects”, naming Eric H. Rudolph as inventor, and bearing attorney docket number MS1-641US.

[0057] Various described embodiments concern an application program interface associated with a development system. According to one example implementation, the interface is exposed to a media processing application to enable a user to dynamically generate complex media processing tasks, e.g., editing projects. In the discussion herein, aspects of the invention are developed within the general context of computer-executable instructions, such as program modules, being executed by one or more conventional computers. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the invention may be practiced with other computer system configurations, including hand-held devices, personal digital assistants, multiprocessor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. In a distributed computer environment, program modules may be located in both local and remote memory storage devices. It is noted, however, that modification to the architecture and methods described herein may well be made without deviating from spirit and scope of the present invention. Moreover, although developed within the context of a media processing system paradigm, those skilled in the art will appreciate, from the discussion to follow, that the application program interface may well be applied to other development system implementations. Thus, the media processing system described below is but one illustrative implementation of a broader inventive concept.

Example System Architecture

[0058]FIG. 2 illustrates an example of a suitable computing environment 200 on which the system and related methods for processing media content may be implemented.

[0059] It is to be appreciated that computing environment 200 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the media processing system. Neither should the computing environment 200 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary computing environment 200.

[0060] The media processing system is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the media processing system include, but are not limited to, personal computers, server computers, thin clients, thick clients, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.

[0061] In certain implementations, the system and related methods for processing media content may well be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The media processing system may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

[0062] In accordance with the illustrated example embodiment of FIG. 2 computing system 200 is shown comprising one or more processors or processing units 202, a system memory 204, and a bus 206 that couples various system components including the system memory 204 to the processor 202.

[0063] Bus 206 is intended to represent one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnects (PCI) buss also known as Mezzanine bus.

[0064] Computer 200 typically includes a variety of computer readable media. Such media may be any available media that is locally and/or remotely accessible by computer 200, and it includes both volatile and non-volatile media, removable and non-removable media.

[0065] In FIG. 2, the system memory 204 includes computer readable media in the form of volatile, such as random access memory (RAM) 210, and/or non-volatile memory, such as read only memory (ROM) 208. A basic input/output system (BIOS) 212, containing the basic routines that help to transfer information between elements within computer 200, such as during start-up, is stored in ROM 208. RAM 210 typically contains data and/or program modules that are immediately accessible to and/or presently be operated on by processing unit(s) 202.

[0066] Computer 200 may further include other removable/non-removable, volatile/non-volatile computer storage media. By way of example only, FIG. 2 illustrates a hard disk drive 228 for reading from and writing to a non-removable, non-volatile magnetic media (not shown and typically called a “hard drive”), a magnetic disk drive 230 for reading from and writing to a removable, non-volatile magnetic disk 232 (e.g., a “floppy disk”), and an optical disk drive 234 for reading from or writing to a removable, non-volatile optical disk 236 such as a CD-ROM, DVD-ROM or other optical media. The hard disk drive 228, magnetic disk drive 230, and optical disk drive 234 are each connected to bus 206 by one or more interfaces 226.

[0067] The drives and their associated computer-readable media provide nonvolatile storage of computer readable instructions, data structures, program modules, and other data for computer 200. Although the exemplary environment described herein employs a hard disk 228, a removable magnetic disk 232 and a removable optical disk 236, it should be appreciated by those skilled in the art that other types of computer readable media which can store data that is accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, random access memories (RAMs), read only memories (ROM), and the like, may also be used in the exemplary operating environment.

[0068] A number of program modules may be stored on the hard disk 228, magnetic disk 232, optical disk 236, ROM 208, or RAM 210, including, by way of example, and not limitation, an operating system 214, one or more application programs 216 (e.g., multimedia application program 224), other program modules 218, and program data 220. In accordance with the illustrated example embodiment of FIG. 2, operating system 214 includes an application program interface embodied as a render engine 222. As will be developed more fully below, render engine 222 is exposed to higher-level applications (e.g., 216) to automatically assemble filter graphs in support of user-defined development projects, e.g., media processing projects. Unlike conventional media processing systems, however, render engine 222 utilizes a scalable, dynamically reconfigurable matrix switch to reduce filter graph complexity, thereby reducing the computational and memory resources required to complete a development project. Various aspects of the innovative media processing system represented by a computer 200 implementing the innovative render engine 222 will be developed further, below.

[0069] Continuing with FIG. 2, a user may enter commands and information into computer 200 through input devices such as keyboard 238 and pointing device 240 (such as a “mouse”). Other input devices may include a audio/video input device(s) 253, a microphone, joystick, game pad, satellite dish, serial port, scanner, or the like (not shown). These and other input devices are connected to the processing unit(s) 202 through input interface(s) 242 that is coupled to bus 206, but may be connected by other interface and bus structures, such as a parallel port, game port, or a universal serial bus (USB).

[0070] A monitor 256 or other type of display device is also connected to bus 206 via an interface, such as a video adapter 244. In addition to the monitor, personal computers typically include other peripheral output devices (not shown), such as speakers and printers, which may be connected through output peripheral interface 246.

[0071] Computer 200 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 250. Remote computer 250 may include many or all of the elements and features described herein relative to computer 200 including, for example, render engine 222 and one or more development applications 216 utilizing the resources of render engine 222.

[0072] As shown in FIG. 2. computing system 200 is communicatively coupled to remote devices (e.g., remote computer 250) through a local area network (LAN) 251 and a general wide area network (WAN) 252. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet.

[0073] When used in a LAN networking environment, the computer 200 is connected to LAN 251 through a suitable network interface or adapter 248. When used in a WAN networking environment, the computer 200 typically includes a modem 254 or other means for establishing communications over the WAN 252. The modem 254, which may be internal or external, may be connected to the system bus 206 via the user input interface 242, or other appropriate mechanism.

[0074] In a networked environment, program modules depicted relative to the personal computer 200, or portions thereof, may be stored in a remote memory storage device. By way of example, and not limitation, FIG. 2 illustrates remote application programs 216 as residing on a memory device of remote computer 250. It will be appreciated that the network connections shown and described are exemplary and other means of establishing a communications link between the computers may be used.

[0075] Turning next to FIG. 3, a block diagram of an example development system architecture is presented, in accordance with one embodiment of the present invention. In accordance with the illustrated example embodiment of FIG. 3, development system 300 is shown comprising one or more application program(s) 216 coupled to render engine 222 via an appropriate communications interface 302. As used herein, application program(s) 216 are intended to represent any of a wide variety of applications which may benefit from use of render engine 222 such as, for example a media processing application 224.

[0076] The communications interface 302 is intended to represent any of a number of alternate interfaces used by operating systems to expose application program interface(s) to applications. According to one example implementation, interface 302 is a component object model (COM) interface, as used by operating systems offered by Microsoft Corporation. As introduced above, COM interface 302 provides a means by which the features of the render engine 222, to be described more fully below, are exposed to an application program 216.

[0077] In accordance with the illustrated example implementation of FIG. 3, render engine 222 is presented comprising source filter(s) 304A-N, transform filter(s) 306A-N and render filter 310, coupled together utilizing virtual pins to facilitate a user-defined media processing project. According to one implementation, the filters of system 300 are similar to the filters exposed in conventional media processing systems. According to one implementation, however, filters are not coupled via such interface pins. Rather, alternate implementations are envisioned wherein individual filters (implemented as objects) make calls to other objects, under the control of the render engine 222, for the desired input. Unlike conventional systems, however, render engine 222 exposes a scalable, dynamically reconfigurable matrix switch filter 308, automatically generated and dynamically configured by render engine 222 to reduce the computational and memory resource requirements often associated with development projects. As introduced above, the pins (input and/or output) are application interface(s) designed to communicatively couple other objects (e.g., filters).

[0078] In accordance with the example implementation of a media processing system, an application communicates with an instance of render engine 222 when the application 216 wants to process streaming media content. Render engine 222 selectively invokes and controls an instance of filter graph manager (not shown) to automatically create a filter graph by invoking the appropriate filters (e.g., source, transform and rendering).As introduced above, the communication of media content between filters is achieved by either (1) coupling virtual output pins of one filter to the virtual input pins of requesting filter; or (2) by scheduling object calls between appropriate filters to communicate the requested information. As shown, source filter 304 receives streaming data from the invoking application or an external source (not shown). It is to be appreciated that the streaming data can be obtained from a file on a disk, a network, a satellite feed, an Internet server, a video cassette recorder, or other source of media content. As introduced above, transform filter(s) 306 take the media content and processes it in some manner, before passing it along to render filter 310. As used herein, transform filter(s) 306 are intended to represent a wide variety of processing methods or applications that can be performed on media content. In this regard, transform filter(s) 306 may well include a splitter, a decoder, a sizing filter, a transition filter, an effects filter, and the like. The function of each of these filters is described more fully in the Griffiths application, introduced above, and generally incorporated herein by reference. The transition filter, as used herein, is utilized by render engine 222 to transition the rendered output from a first source to a second source. The effect filter is selectively invoked to introduce a particular effect (e.g., fade, wipe, audio distortion, etc.) to a media stream.

[0079] In accordance with one aspect of the embodiment, to be described more fully below, matrix switch filter 308 selectively passes media content from one or more of a scalable plurality of input(s) to a scalable plurality of output(s). Moreover, matrix switch 308 also supports implementation of a cascaded architecture utilizing feedback paths, i.e., wherein transform filters 306B, 306C, etc. coupled to the output of matrix switch 308 are dynamically coupled to one or more of the scalable plurality of matrix switch input(s). An example of this cascaded filter graph architecture is introduced in FIG. 3, and further explained in example implementations, below.

[0080] Typically, media processed through source, transform and matrix switch filters are ultimately passed to render filter 310, which provides the necessary interface to a hardware device, or other location that accepts the renderer output format, such as a memory or disk file, or a rendering device.

[0081]FIG. 4 is a graphical illustration of an example software-enabled matrix switch 308, according to one example embodiment of the present invention. As shown, the matrix switch 308 is comprised of a scalable plurality of input(s) 402 and a scalable plurality of output(s) 404, wherein any one or more of the input(s) 402 may be iteratively coupled to any one or more of the output(s) 404, based on the content of the matrix switch programming grid 406, automatically generated by render engine 222. According to an alternate implementation introduced above, switch matrix 308 is programmed by render engine 222 to dynamically generate object calls to communicate media content between filters. In addition, according to one implementation, matrix switch 308 includes a plurality of input/output (I/O) buffers 408, as well as means for maintaining source, or media time 410 and/or timeline, or project time 412. It is to be appreciated, however, that in alternate implementations matrix switch 308 does not maintain both source and project times, relying on an upstream filter to convert between these times. As will be developed more fully below, matrix switch 308 dynamically couples one or more of the scalable plurality of inputs 402 to one or more of the scalable plurality of outputs 404 based, at least in part, on the media time 410 and/or the project time 412 and the content of matrix switch programming grid 406. In this regard, matrix switch 308 may be characterized as time-aware, supporting such advanced editing features as searching/seeking to a particular point (e.g., media time) in the media content, facilitating an innovative buffering process utilizing I/O buffers 408 to facilitate look-ahead processing of media content, and the like. Thus, it will be appreciated given the discussion to follow that introduction of the matrix switch 308 provides a user with an editing flexibility that was heretofore unavailable in a personal computer-based media processing system.

[0082] As introduced above, the inputs 402 and outputs 404 of matrix switch 308 are interfaces which facilitate the time-sensitive routing of data (e.g., media content) in accordance with a user-defined development project. Matrix switch 308 has a scalable plurality of inputs 402 and outputs 404, meaning that the number of inputs 402 and outputs 404 are individually generated to satisfy a given editing project. Insofar as each of the inputs/outputs (I/O) has an associated transfer buffer (preferably shared with an adjacent filter) to communicate media content, the scalability of the input/output serves to reduce the overall buffer memory consumed by an editing project. According to one implementation, output 1 is generally reserved as a primary output, e.g., coupled to a rendering filter (not shown).

[0083] According to one implementation, for each input 402 and output 404, matrix switch 308 attempts to be the allocator, or manager of the buffer associated with the I/O(s) shared with adjacent filters. One reason is to ensure that all of the buffers are of the same size and share common attributes so that a buffer associated with any input 402 may be shared with any output 404, thereby reducing the need to copy memory contents between individual buffers associated with such inputs/outputs. If matrix switch 308 cannot be an allocator for a given output (404), communication from an input (402) to that output is performed using a conventional memory copy operation between the individual buffers associated with the select input/output.

[0084] As introduced above, the matrix switch programming grid 406 is dynamically generated by render engine 222 based, at least in part, on the user-defined development project. As will be developed below, render engine 222 invokes an instance of filter graph manager to assembles a tree structure of an editing project, noting dependencies between source, filters and time to dynamically generate the programming grid 406. A data structure comprising an example programming grid 406 is introduced with reference to FIG. 5, below.

[0085] Turning briefly to FIG. 5, a graphical representation of a data structure comprising an example programming grid 406 is presented, in accordance with one embodiment of the present invention. In accordance with the illustrated example embodiment of FIG. 5, programming grid 406 is depicted as a two-dimensional data structure comprising a column along the y-axis 502 of the grid denoting input pins associated with a content chain (e.g., series of filters to process media content) of the development project. The top row along the x-axis 504 of the data structure denotes project time. With these grid “borders”, the body 506 of the grid 406 is populated with output pin assignments, denoting which input pin is coupled to which output pin during execution of the development project. In this way, render engine 222 dynamically generates and facilitates matrix switch 308. Those skilled in the art will appreciate, however, that data structures of greater or lesser complexity may well be used in support of the programming grid 406 without deviating from the spirit and scope of the present invention.

[0086] Returning to FIG. 4, matrix switch 308 is also depicted with a plurality of input/output buffers 408, shared among all of the input(s)/ouptut(s) (402, 404) to facilitate advanced processing features. That is, while not required to implement the core features of matrix switch 308, I/O buffers 408 facilitate a number of innovative performance enhancing features to improve the performance (or at least the user's perception of performance) of the processing system, thereby providing an improved user experience. According to one implementation, I/O buffers 408 are separate from the buffers assigned to each individual input and output pin in support of communication through the switch. According to one implementation, I/O buffers 408 are primarily used to foster look-ahead processing of the project. Assume, for example, that a large portion of the media processing project required only 50% of the available processing power, while some smaller portion required 150% of the available processing power. Implementation of the shared I/O buffers 408 enable filter graph manager to execute tasks ahead of schedule and buffer this content in the shared I/O buffers 408 until required. Thus, when execution of the filter graph reaches a point where more than 100% of the available processing power is required, the processing system can continue to supply content from the I/O buffers 408, while the system completes execution of the CPU-intensive tasks. If enough shared buffer space is provided, the user should never know that some tasks were not performed in real-time. According to one implementation, shared buffers 408 are dynamically split into two groups by render engine 222, a first group supports the input(s) 402, while a second (often smaller) group is used in support of a primary output (e.g., output pin 1) to facilitate a second, independent output processing thread. The use of an independent output buffers the render engine from processing delays that might occur in upstream and/or downstream filters, as discussed above. It will be appreciated by those skilled in the art that such that matrix switch 308 and the foregoing described architecture beneficially suited to support media streaming applications.

[0087] As introduced above, the filter graph is time-aware in the sense that media (source) time and project execution time are maintained. According to one implementation, matrix switch 308 maintains at least the project clock, while an upstream filter maintains the source time, converting between source and project time for all downstream filters (i.e., including the matrix switch 308). According to one implementation, the frame rate converter filter of a filter graph is responsible for converting source time to project time, and vice versa, i.e., supporting random seeks, etc. Alternatively, matrix switch 308 utilizes an integrated set of clock(s) to independently maintain project and media times.

[0088] Having introduced the architectural and operational elements of matrix switch filter 308, FIG. 6 graphically illustrates an example filter graph implementation incorporating the innovative matrix switch 308. In accordance with the illustrated example embodiment, filter graph 600 is generated by render engine 222 in response to a user defined development project. Unlike the lengthy linear filter graphs typical of convention development systems however, filter graph 600 is shown incorporating a matrix switch filter 308 to recursively route the pre-processed content (e.g., through filters 602, 606, 610, 614 and 618, described more fully below) through a user-defined number of transform filters including, for example, transition filter(s) 620 and effects filter(s) 622. Moreover, as will be developed more fully below, the scalable nature of matrix switch filter 308 facilitates such iterative processing for any number of content threads, tracks or compositions.

[0089] According to one implementation, a matrix switch filter 308 can only process one type of media content, of the same size and at the same frame-rate (video) or modulation type/schema (audio). Thus, FIG. 6 is depicted comprising pre-processing filters with a parser filter 606 to separate, independent content type(s) (e.g., audio content and video content), wherein one of the media types would be processed along a different path including a separate instance of matrix switch 308. Thus, in accordance with the illustrated example embodiment of a media processing system, processing multimedia content including audio and video would utilize two (2) matrix switch filters 308, one dedicated to audio processing (not shown) and one dedicated to video processing. That is not to say, however, that multiple switch filters 308 could not be used (e.g., two each for audio and video) for each content type in alternate implementations. Similarly, it is anticipated that in alternate implementations a matrix switch 308 that accepts multiple media types could well be used without deviating from the spirit and scope of the present invention.

[0090] In addition filter graph 600 includes a decoder filter 610 to decode the media content. Resize filter 614 is employed when matrix switch 308 is to receive content from multiple sources, ensuring that the size of the received content is the same, regardless of the source. According to one implementation, resize filter 614 is selectively employed in video processing paths to adjust the media size of content from one or more sources to a user-defined level. Alternatively, resizer filter 614 adjusts the media size to the largest size provided by any one or more media sources. That is, if, for example, render engine 222 identifies the largest required media size (e.g., 1270×1040 video pixels per frame) and, for any content source not providing content at this size, the content is modified (e.g., stretched, packed, etc.) to fill this size requirement. The frame rate converter (FRC) and pack filter 618, introduced above, ensures that video content from the multiple sources is arriving at the same frame rate, e.g., ten (10) frames per second. As introduced above, the FRC also maintains the distinction between source time and project time.

[0091] In accordance with one aspect of the present invention, filter graph 600 is depicted utilizing a single, negotiated buffer 604, 608, 612, 616, etc. between adjacent filters. In this regard, render engine 222 reduces the buffer memory requirements in support of a development project.

[0092] From the point of pre-processing (filters 602, 606, 610, 614, 618), rather than continue a linear filter graph incorporating all of the transition 620 and effect 622 filter(s), render engine 222 utilizes a cascade architecture, recursively passing media content through the matrix switch 308 to apply to the transform filter(s) (e.g., 620, 622, etc.) to complete the execution of the development project. It will be appreciated by those skilled in the art that the ability to recursively pass media content through one or more effect and/or transition filters provided by the matrix switch filter 308 greatly reduces the perceived complexity of otherwise large filter graphs, while reducing memory and computational overhead.

[0093] Turning to FIG. 7, a flow chart of an example method for generating a filter graph is presented, in accordance with one aspect of the present invention. The method 700 begins with block 702 wherein render engine 222 receives an indication to generate a filter graph representing a user-defined development project (e.g., a media editing project). According to one example implementation, the indication is received from an application 224 via COM interface(s) 302.

[0094] In block 704, render engine 222 facilitates generation of the editing project, identifying the number and type of media sources selected by the user. In block 706, based at least in part on the number and/or type of media sources, filter graph manger 222 exposes source, transform and rendering filter(s) to effect a user defined media processing project, while beginning to establish a programming grid 406 for the matrix switch filter 308.

[0095] In block 708, reflecting user editing instructions, render engine 222 completes the programming grid 406 for matrix switch 308, identifying which inputs 402 are to be coupled to which outputs 404 at particular project times.

[0096] Based, at least in part, on the programming grid 406 render engine 222 generates a matrix switch filter 308 with an appropriate number of input 402 and output 404 pins to effect the project, and assembles the filter graph, block 710.

[0097] In block 712, to reduce the buffer memory requirements for the processing project, the render engine 222 instructs the filters populating the filter graph to (re)negotiate buffer memory requirements between filters. That is, adjacent filters attempt to negotiate a size and attribute standard so that a single buffer can be utilized to couple each an output pin of one filter to an input pin of a downstream filter. An example implementation of the buffer negotiation process of block 712 presented in greater detail with reference to FIG. 8.

[0098] Turning briefly to FIG. 8, an example method of negotiating buffer requirements between adjacent filters is presented, in accordance with one example implementation of the present invention. Once the final connection is established to matrix switch 308, matrix switch 308 identifies the maximum buffer requirements for any filter coupled to any of its pins (input 402 and/or output 404), block 802. According to one implementation, the maximum buffer requirements are defined as the lowest common multiple of buffer alignment requirements, and the maximum of all the pre-fix requirements of the filter buffers.

[0099] In block 804, matrix switch 308 selectively removes one or more existing filter connections to adjacent filters. Matrix switch 308 then reconnects all of its pins to adjacent filters using a common buffer size between each of the pins, block 806. In block 808, matrix switch 308 negotiates to be the allocator for all of its pins (402, 404). If the matrix switch 308 cannot, for whatever reason, be the allocator for any of its input pins 402 minimal loss to performance is encountered, as the buffer associated with the input pin will still be compatible with any downstream filter (i.e., coupled to an output pin) and, thus, the buffer can still be passed to the downstream filter without requiring a memory copy operation. If, however, matrix switch 308 cannot be an allocator for one of its output pins 404, media content must then be transferred to at least the downstream filter associated with that output pin using a memory copy operation, block 810.

[0100] In block 812, once the matrix switch 308 has re-established its connection to adjacent filters, render engine 222 restores the connection in remaining filters using negotiated buffer requirements emanating from the matrix switch filter 308 buffer negotiations. Once the connections throughout the filter graph have been reconnected, the process continues with block 714 of FIG. 7.

[0101] In block 714 (FIG. 7), have re-established the connections between filters, render engine 222 is ready to implement a user's instruction to execute the media processing project.

Example Operation and Implementation(s)

[0102] The matrix switch described above is quite useful in that it allows multiple inputs to be directed to multiple outputs at any one time. These input can compete for a matrix switch output. The embodiments described below permit these competing inputs to be organized so that the inputs smoothly flow through the matrix switch to provide a desired output. And, while the inventive programming techniques are described in connection with the matrix switch as such is employed in the context of multi-media editing projects, it should be clearly understood that application of the inventive programming techniques and structures should not be so limited only to application in the field of multi-media editing projects or, for that matter, multi-media applications or data streams. Accordingly, the principles about to be discussed can be applied to other fields of endeavor in which multiple inputs can be characterized as competing for a particular output during a common time period.

[0103] In the multi-media example below, the primary output of the matrix switch is a data stream that defines an editing project that has been created by a user. Recall that this editing project can include multiple different sources that are combined in any number of different ways, and the sources that make up a project can comprise audio sources, video sources, or both. The organization of the inputs and outputs of the matrix switch are made manageable, in the examples described below, by a data structure that permits the matrix switch to be programmed.

[0104]FIG. 9 shows an overview of a process that takes a user-defined editing project and renders from it a data structure that can be used to program the matrix switch.

[0105] Specifically, a user-defined editing project is shown generally at 900. Typically, when a user creates an editing project, they can select from a number of different multimedia clips that they can then assemble into a unique presentation. Each individual clip represents a source of digital data or a source stream (e.g., multimedia content). Projects can include one or more sources 902. In defining their project, a user can operate on sources in different ways. For example, video sources can have transitions 904 and effects 906 applied on them. A transition object is a way to change between two or more sources. As discussed above, a transition essentially receives as input, two or more streams, operates on them in some way, and produces a single output stream. An exemplary transition can comprise, for example, fading from one source to another. An effect object can operate on a single source or on a composite of sources. An effect essentially receives a single input stream, operates on it in some way, and produces a single output stream. An exemplary effect can comprise a black-and-white effect in which a video stream that is configured for presentation in color format is rendered into a video stream that is configured for presentation in black and white format. Unlike conventional effect filters, effect object 906 may well perform multiple effect tasks. That is, in accordance with one implementation, an effect object (e.g., 906) may actually perform multiple tasks on the received input stream, wherein said tasks would require multiple effect filters in a conventional filter graph system.

[0106] An exemplary user interface 908 is shown and represents what a user might see when they produce a multimedia project with software executing on a computer. In this example, the user has selected three sources A, B, and C, and has assembled the sources into a project timeline. The project timeline defines when the individual sources are to be rendered, as well as when any transitions and/or effects are to occur.

[0107] In the discussion that follows, the notion of a track is introduced. A track can contain one or more sources or source clips. If a track contains more than one source clip, the source clips cannot overlap. If source clips are to overlap (e.g. fading from one source to another, or having one source obscure another), then multiple tracks are used. A track can thus logically represent a layer on which sequential video is produced. User interface 908 illustrates a project that utilizes three tracks, each of which contains a different source. In this particular project source A will show for a period of time. At a defined time in the presentation, source A is obscured by source B. At some later time, source B transitions to source C.

[0108] In accordance with the described embodiment, the user-defined editing project 900 is translated into a data structure 910 that represents the project. In the illustrated and described example, this data structure 910 comprises a tree structure. It is to be understood, however, that other data structures could be used. The use of tree structures to represent editing projects is well-known and is not described here in any additional detail. Once the data structure 910 is defined, it is processed to provide a data structure 912 that is utilized to program the matrix switch. In the illustrated and described embodiment, data structure 912 comprises a grid from which the matrix switch can be programmed. It is to be understood and appreciated that other data structures and techniques could, however, be used to program the matrix switch without departing from the spirit and scope of the claimed subject matter.

[0109] The processing that takes place to define data structures 910 and 912 can take place using any suitable hardware, software, firmware, or combination thereof. In the examples set forth below, the processing takes place utilizing software in the form of a video editing software package that is executable on a general purpose computer.

EXAMPLE PROJECT

[0110] For purposes of explanation, consider FIG. 10 which shows project 908 from FIG. 9 in a little additional detail. Here, a time line containing numbers 0-16 is provided adjacent the project to indicate when particular sources are to be seen and when transitions and effects (when present) are to occur. In the examples in this document, the following convention exists with respect to projects, such as project 908. A priority exists for video portions of the project such that as one proceeds from top to bottom, the priority increases. Thus, in the FIG. 10 example, source A has the lowest priority followed by source B and source C. Thus, if there an overlap between higher and lower priority sources, the higher priority source will prevail. For example, source B will obscure source A from between t=4-8.

[0111] In this example, the following can be ascertained from the project 908 and time line: from time t=0-4 source A should be routed to the matrix switch's primary output; from t=4-12 source B should be routed to the matrix switch's primary output; from t=12-14 there should be a transition between source B and source C which should be routed to the matrix switch's primary output; and from t=14-16 source C should be routed to the matrix switch's primary output. Thus, relative to the matrix switch, each of the sources and the transition can be characterized by where it is to be routed at any given time. Consider, for example, the table just below: Object Routing for a given time C t = 0-12 (nowhere); t = 12-14 (transition); t = 14-6 (primary output) B t = 0-4 (nowhere); t = 4-12 (primary output); t = 12-14 (transition); t = 14-16 (nowhere) A t = 0-4 (primary output); t = 4-16 (nowhere) Transition t = 0-12 (nowhere); t = 12-14 (primary output); t = 14-16 (nowhere)

[0112]FIG. 11 shows an exemplary matrix switch 1100 that can be utilized in the presentation of the user's project. Matrix switch 1100 comprises multiple inputs and multiple outputs. Recall that a characteristic of the matrix switch 1100 is that any of the inputs can be routed to any of the outputs at any given time. A transition element 1102 is provided and represents the transition that is to occur between sources B and C. Notice that the matrix switch includes four inputs numbered 0-3 and three outputs numbered 0-2. Inputs 0-2 correspond respectively to sources A-C, while input 3 corresponds to the output of the transition element 1102. Output 0 corresponds to the switch's primary output, while outputs 1 and 2 are routed to the transition element 1102.

[0113] The information that is contained in the table above is the information that is utilized to program the matrix switch. The discussion presented below describes but one implementation in which the information contained in the above table can be derived from the user's project time line.

[0114] Recall that as a user edits or creates a project, software that comprises a part of their editing software builds a data structure that represents the project. In the FIG. 9 overview, this was data structure 910. In addition to building the data structure that represents the editing project, the software also builds and configures a matrix switch that is to be used to define the output stream that embodies the project. Building and configuring the matrix switch can include building the appropriate graphs (e.g., a collection of software objects, or filters) that are associated with each of the sources and associating those graphs with the correct inputs of the matrix switch. In addition, building and configuring the matrix switch can also include obtaining and incorporating additional appropriate filters with the matrix switch, e.g. filters for transitions, effects, and mixing (for audio streams). This will become more apparent below.

[0115]FIG. 12 shows a graphic representation of an exemplary data structure 1200 that represents the project of FIG. 10. Here, the data structure comprises a traditional hierarchical tree structure. Any suitable data structure can, however, be utilized. The top node 1202 constitutes a group node. A group encapsulates a type of media. For example, in the present example the media type comprises video. Another media type is audio. The group node can have child nodes that are either tracks or composites. In the present example, three track nodes 1204, 1206, and 1208 are shown. Recall that each track can have one or more sources. If a track comprises more than one source, the sources cannot overlap. Here, all of the sources (A, B, and C) overlap. Hence, three different tracks are utilized for the sources. In terms of priority, the lowest priority source is placed into the tree furthest from the left at 1204 a. The other sources are similarly placed. Notice that source C (1208 a) has a transition 1210 associated with it. A transition object, in this example, defines a two-input/one output operation. When applied to a track or a composition (discussed below in more detail), the transition object will operate between the track to which it has been applied, and any objects that are beneath it in priority and at the same level in the tree. A “tree level” has a common depth within the tree and belongs to the same parent. Accordingly, in this example, the transition 1210 will operate on a source to the left of the track on which source C resides, and beneath it in priority, i.e. source B. If the transition is applied to any object that has nothing beneath it in the tree, it will transition from blackness (and/or silence if audio is included).

[0116] Once a data structure representing the project has been built, in this case a hierarchical tree structure, a rendering engine processes the data structure to provide another data structure that is utilized to program the matrix switch. In the FIG. 9 example, this additional data structure is represented at 912. It will be appreciated and understood that the nodes of tree 1200 can include so-called meta information such as a name, ID, and a time value that represents when that particular node's object desires to be routed to the output, e.g. node 1204 a would include an identifier for the node associating it with source A, as well as a time value that indicates that source A desires to be routed to the output from time t=0-8. This meta information is utilized to build the data structure that is, in turn, utilized to program the matrix switch.

[0117] In the example about to be described below, a specific data structure in the form of a grid is utilized. In addition, certain specifics are described with respect to how the grid is processed so that the matrix switch can be programmed. It is to be understood that the specific described approach is for exemplary purposes only and is not intended to limit application of the claims. Rather, the specific approach constitutes but one way of implementing broader conceptual notions embodied by the inventive subject matter.

[0118] FIGS. 13-18 represent a process through which the inventive grid is built. In the grid about to be described, the x axis represents time, and the y axis represents layers in terms of priority that go from lowest (at the top of the grid) to highest (at the bottom of the grid). Every row in the grid represents the video layer. Additionally, entries made within the grid represent output pins of the matrix switch. This will become apparent below.

[0119] The way that the grid is built in this example is that the rendering engine does a traversal operation on the tree 1200. In this particular example, the traversal operation is known as a “depth-first, left-to-right” traversal. This operation will layerize the nodes so that the leftmost track or source has the lowest priority and so on. Doing the above-mentioned traversal on tree 1200 (FIG. 12), the first node encountered is node 1204 which is associated with source A. This is the lowest priority track or source. A first row is defined for the grid and is associated with source A. After the first grid row is defined, a grid entry is made and represents the time period for which source A desires to be routed to the matrix switch's primary output.

[0120]FIG. 13 shows the state of a grid 1300 after this first processing step. Notice that from time t=0-8, a “0” has been placed in the grid. The “0” represents the output pin of the matrix switch—in this case the primary output. Next, the traversal encounters node 1206 (FIG. 12) which is associated with source B. A second row is thus defined for the grid and is associated with source B. After the second grid row is defined, a grid entry is made and represents the time period for which source B desires to be routed to the matrix switch's primary output.

[0121]FIG. 14 shows the state of grid 1300 after this second processing step. Notice that from time t=4-14, a “0” has been placed in the grid. Notice at this point that something interesting has occurred which will be resolved below. Each of the layers has a common period of time (i.e. t =4-8) for which it desires to be routed to the matrix switch's primary output. However, because of the nature of the matrix switch, only one input can be routed to the primary output at a time. Next, the traversal encounters node 1208 (FIG. 12) which is associated with source C. In this particular processing example, a rule is defined that sources on tracks are processed before transitions on the tracks are processed because transitions operate on two objects that are beneath them. A third row is thus defined for the grid and is associated with source C. After the third row is defined, a grid entry is made and represents the time period for which source C desires to be routed to the matrix switch's primary output.

[0122]FIG. 15 shows the state of grid 1300 after this third processing step. Notice that from time t=12-16, a “0” has been placed in the grid. Next, the traversal encounters node 1210 (FIG. 12) which corresponds to the transition. Thus, a fourth row is defined in the grid and is associated with the transition. After the fourth row is defined, a grid entry is made and represents the time period for which the transition desires to be routed to the matrix switch's primary output.

[0123]FIG. 16 shows the state of grid 1300 after this fourth processing step. Notice that from time t=12-14, a “0” has been placed in the grid for the transition entry. The transition is a special grid entry. Recall that the transition is programmed to operate on two inputs and provide a single output. Accordingly, starting at the transition entry in the grid and working backward, each of the entries corresponding to the same tree level are examined to ascertain whether they contain entries that indicate that they want to be routed to the output during the same time that the transition is to be routed to the output. If grid entries are found that conflict with the transition's grid entry, the conflicting grid entry is changed to a value to corresponds to an output pin that serves as an input to the transition element 1102 (FIG. 11). This is essentially a redirection operation. In the illustrated grid example, the transition first finds the level that corresponds to source C. This level conflicts with the transition's grid entry for the time period t=12-14. Thus, for this time period, the grid entry for level C is changed to a switch output that corresponds to an input for the transition element. In this example, a “2” is placed in the grid to signify that for this given time period, this input is routed to output pin 2. Similarly, continuing up the grid, the next level that conflicts with the transition's grid entry is the level that corresponds to source B. Thus, for the conflicting time period, the grid entry for level B is changed to a switch output that corresponds to an input for the transition element. In this example, a “1” is placed in the grid to signify that for this given time period, this input is routed to output pin 1 of the matrix switch.

[0124]FIG. 17 shows the state of the grid at this point in the processing. Next, a pruning function is implemented which removes any other lower priority entry that is contending for the output with a higher priority entry. In the example, the portion of A from t=4-8 gets removed because the higher priority B wants the output for that time.

[0125]FIG. 18 shows the grid with a cross-hatched area that signifies that portion of A's grid entry that has been removed.

[0126] At this point, the grid is in a state in which it can be used to program the matrix switch. The left side entries—A, B, C, and TRANS represent input pin numbers 0, 1, 2, and 3 (as shown) respectively, on the matrix switch shown in FIG. 11. The output pin numbers of the matrix switch are designated at 0, 1, and 2 both on the switch in FIG. 11 and within the grid in FIG. 18. As one proceeds through the grid, starting with source A, the programming of the matrix switch can be ascertained as follows: A is routed to output pin 0 of the matrix switch (the primary output) from t=0-4. From t=4-16, A is not routed to any output pins. From t=0-4, B is not routed to any of the output pins of the matrix switch. From t=4-12, B is routed to the primary output pin 0 of the matrix switch. From t=12-14, B is routed to output pin 1 of the matrix switch. Output pin 1 of the matrix switch corresponds to one of the input pins for the transition element 1102 (FIG. 1). From t=14-16, B is not routed to any of the output pins of the matrix switch. From t=0-12, C is not routed to any of the output pins of the matrix switch. From t=12-14, C is routed to output pin 2 of the matrix switch. Output pin 2 of the matrix switch corresponds to one of the input pins for the transition element 302 (FIG. 3). From t=12-14 the transition element (input pin 3) is routed to output pin 0. From t =14-16, C is routed to output pin 0 of the matrix switch.

[0127] As alluded to above, one of the innovative aspects of the matrix switch 308 is its ability to seek to any point in a source, without having to process the intervening content serially through the filter. Rather, matrix switch 308 identifies an appropriate transition point and dumps at least a subset of the intervening content, and continues processing from the seeked point in the content.

[0128] The ability of the matrix switch 308 to seek to any point in the media content gives rise to certain performance enhancement heretofore unavailable in computer implemented media processing systems. For example, generation of a filter graph by render engine 222 may take into account certain performance characteristics of the media processing system which will execute the user-defined media processing project. In accordance with this example implementation, render engine 222 may access and analyze the system registry of the operating system, for example, to ascertain the performance characteristics of hardware and/or software elements of the computing system implementing the media processing system, and adjust the filter graph construction to improve the perceived performance of the media processing system by the user. Nonetheless, there will always be a chance that a particular instance of a filter graph will not be able to process the media stream fast enough to provide the desired output at the desired time, i.e., processing of the media stream bogs down leading to delays at the rendering filter. In such a case, matrix switch 308 will recognize that it is not receiving media content at the appropriate project time, and may skip certain sections of the project in an effort to “catch-up” and continue the remainder of the project in real time. According to one implementation, when matrix switch 308 detects such a lag in processing, it will analyze the degree of the lag and issue a seek command to the source (through the source processing chain) to a future point in the project, where processing continues without processing any further content prior to the seeked point.

[0129] Thus, for the editing project depicted in FIG. 10, the processing described above first builds a data structure (i.e. data structure 1200 in FIG. 12) that represents the project in hierarchical space, and then uses this data structure to define or create another data structure that can be utilized to program the matrix switch.

[0130]FIG. 19 is a flow diagram that describes steps in a method in accordance with the described embodiment. The method can be implemented in any suitable hardware, software, firmware, or combination thereof. In the illustrated and described embodiment, the method is implemented in software.

[0131] Step 1900 provides a matrix switch. An exemplary matrix switch is described above. Step 1902 defines a first data structure that represents the editing project. Any suitable data structure can be used, as will be apparent to those of skill in the art. In the illustrated and described embodiment, the data structure comprises a hierarchical tree structure having nodes that can represent tracks (having one or more sources), composites, transitions and effects. Step 1904 processes the first data structure to provide a second data structure that is configured to program the matrix switch. Any suitable data structure can be utilized to implement the second data structure. In the illustrated and described embodiment, a grid structure is utilized. Exemplary processing techniques for processing the first data structure to provide the second data structure are described above. Step 1906 then uses the second data structure to program the matrix switch.

EXAMPLE PROJECT WITH A TRANSITION AND AN EFFECT

[0132] Consider project 2000 depicted in FIG. 20. In this project there are three tracks, each of which contains a source, i.e. source A, B and C. This project includes an effect applied on source B and a transition between sources B and C. The times are indicated as shown.

[0133] As the user creates their project, a data structure representing the project is built. FIG. 21 shows an exemplary data structure in the form of a hierarchical tree 2100 that represents project 2000. There, the data structure includes three tracks, each of which contains one of the sources. The sources are arranged in the tree structure in the order of their priority, starting with the lowest priority source on the left and proceeding to the right. There is an effect (i.e. “Fx”) that is attached to or otherwise associated with source B. Additionally, there is a transition attached to or otherwise associated with source C.

[0134] In building the grid for project 2000, the following rule is employed for effects. An effect, in this example, is a one-input/one-output object that is applied to one object-in this case source B. When the effect is inserted into the grid, it looks for any one object beneath it in priority that has a desire to be routed to the primary output of the matrix switch at the same time. When it finds a suitable object, it redirects that object's output from the matrix switch's primary output to an output associated with the effect.

[0135] As an example, consider FIG. 22 and the grid 2200. At this point in the processing of tree 2100, the rendering engine has incorporated entries in the grid corresponding to sources A, B and the effect. It has done so by traversing the tree 2100 in the above-described way. In this example, the effect has already looked for an object beneath it in priority that is competing for the primary output of the matrix switch. It found an entry for source B and then redirected B's grid entry to a matrix switch output pin that corresponds to the effect-here output pin 1.

[0136] As the render engine 222 completes its traversal of tree 2100, it completes the grid. FIG. 23 shows a completed grid 2200. Processing of the grid after that which is indicated in FIG. 22 takes place substantially as described above with respect to the first example. Summarizing, this processing though: after the effect is entered into the grid and processed as described above, the traversal of tree 2100 next encounters the node associated with source C. Thus, a row is added in the grid for source C and an entry is made to indicate that source C desires the output from t=12-16. Next, the tree traversal encounters the node associated with the transition. Accordingly, a row is added to the grid for the transition and a grid entry is made to indicate that the transition desires the output from t=12-14. Now, as described above, the grid is examined to find two entries, lower in priority than the transition and located at the same tree level as the transition, that compete for the primary output of the matrix switch. Here, those entries correspond to the grid entries for the effect and source C that occur from t=12-14. These grid entries are thus redirected to output pins of the matrix switch 308 that correspond to the transition—here pins 2 and 3 as indicated. Next, the grid is pruned which, in this example, removes a portion of the grid entry corresponding to source A for t=4-8 because of a conflict with the higher-priority entry for source B.

[0137]FIG. 24 shows the resultant matrix switch that has been built and configured as the grid was being processed above. At this point, the grid can be used to program the matrix switch. From the grid picture, it is very easy to see how the matrix switch 308 is going to be programmed. Source A will be routed to the matrix switch's primary output (pin 0) from t=0-4; source B will be redirected to output pin 1 (effect) from t=4-14 and the effect on B will be routed to the output pin 0 from t=4-12. From t=12-14, the effect and source C will be routed to output pins corresponding to the transition (pins 2 and 3) and, accordingly, during this time the transition (input pin 4) will be routed to the primary output (output pin 0) of the matrix switch. From t=14-16, source C will be routed to the primary output of the matrix switch.

[0138] It will be appreciated that as the software, in this case the render engine 222, traverses the tree structure that represents a project, it also builds the appropriate graphs and adds the appropriate filters and graphs to the matrix switch. Thus, for example, as the render engine 222 encounters a tree node associated with source A, in addition to adding an entry to the appropriate grid, the software builds the appropriate graphs (i.e. collection of linked filters), and associates those filters with an input of the matrix switch. Similarly, when the render engine 222 encounters an effect node in the tree, the software obtains an effect object or filter and associates it with the appropriate output of the matrix switch. Thus, in the above examples, traversal of the tree structure representing the project also enables the software to construct the appropriate graphs and obtain the appropriate objects and associate those items with the appropriate inputs/outputs of the matrix switch 308. Upon completion of the tree traversal and processing of the grid, an appropriate matrix switch has been constructed, and the programming (i.e. timing) of inputs to outputs for the matrix switch has been completed.

[0139] Treatment of “Blanks” in a Project

[0140] There may be instances in a project when a user leaves a blank in the project time line. During this blank period, no video or audio is scheduled for play.

[0141]FIG. 25 shows a project that has such a blank incorporated therein. If there is such a blank left in a project, the software is configured to obtain a “black” source and associate the source with the matrix switch at the appropriate input pin. The grid is then configured when it is built to route the black source to the output at the appropriate times and fade from the black (and silent) source to the next source at the appropriate times. The black source can also be used if there is a transition placed on a source for which there is no additional source from which to transition.

[0142] Audio Mixing

[0143] In the examples discussed above, sources comprising video streams were discussed. In those examples, at any one time, only two video streams were combined into one video stream. However, each project can, and usually does contain an audio component. Alternately, a project can contain only an audio component. The audio component can typically comprise a number of different audio streams that are combined. The discussion below sets forth but one way of processing and combining audio streams.

[0144] In the illustrated example, there is no limit on the number of audio streams that can be combined at any one time.

[0145] Suppose, for example, there is an audio project that comprises 5 tracks, A-E. FIG. 26 shows an exemplary project. The shaded portions of each track represent the time during which the track is not playing. So, for example, at t=0-4, tracks B, D, and E are mixed together and will play. From t=4-10, tracks A-E are mixed together and will play, and the like.

[0146]FIG. 27 shows the grid for this project at 2700. Since we are dealing with this composition now, all of the effects and transitions including the audio mixing are only allowed to affect things in this composition. Thus, there is the concept of a boundary 2702 that prevents any actions or operations in this composition from affecting any other grid entries. Note that there are other entries in the grid and that the presently-illustrated entries represent only those portions of the project that relate to the audio mixing function.

[0147] Grid 2700 is essentially set up in a manner similar to that described above with respect to the video projects. That is, for each track, a row is added to the grid and a grid entry is made for the time period during which the source on that track desires to be routed to the primary output of the matrix switch. In the present example, grid entries are made for sources A-E. Next, in the same way that a transition or effect was allocated a row in the grid, a “mix” element is allocated a row in the grid as shown and a grid entry is made to indicate that the mix element desires to be routed to the primary output of the matrix switch for a period of time during which two or more sources compete for the matrix switch's primary output. Note that in this embodiment, allocation of a grid row for the mix element can be implied. Specifically, whereas in the case of a video project, overlapping sources simply result in playing the higher priority source (unless the user defines a transition between them), in the audio realm, overlapping sources are treated as an implicit request to mix them. Thus, the mix element is allocated a grid row any time there are two or more overlapping sources.

[0148] Once the mix element is allocated into the grid, the grid is processed to redirect any conflicting source entries to matrix switch output pins that correspond to the mix element. In the above case, redirection of the grid entries starts with pin and proceeds through to pin 7. The corresponding matrix switch is shown in FIG. 28. Notice that all of the sources are now redirected through the mix element which is a multi-input/one output element. The mix element's output is fed back around and becomes input pin 15 of the matrix switch. All of the programming of the matrix switch is now reflected in the grid 2700. Specifically, for the indicated time period in the grid, each of the sources is routed to the mix element which, in turn, mixes the appropriate audio streams and presents them to the primary output pin 0 of the matrix switch.

[0149] Compositions

[0150] There are situations that can arise when building an editing project where it would be desirable to apply an effect or a transition on just a subset of a particular project or track. Yet, there is no practicable way to incorporate the desired effect or transition. In the past, attempts to provide added flexibility for editing projects have been made in the form of so called “bounce tracks”, as will be appreciated and understood by those of skill in the art. The use of bounce tracks essentially involves processing various video layers (i.e. tracks), writing or moving the processed layers or tracks to another location, and retrieving the processed layers when later needed for additional processing with other layers or tracks. This type of processing can be slow and inefficient.

[0151] To provide added flexibility and efficiency for multi-media editing projects, the notion of a composite or composition is introduced. A composite or composition can be considered as a representation of an editing project as a single track. Recall that editing projects can have one or more tracks, and each track can be associated with one or more sources that can have effects applied on them or transitions between them. In addition, compositions can be nested inside one another.

EXAMPLE PROJECT WITH COMPOSITE

[0152] Consider, for example, FIG. 29 which illustrates an exemplary project 2900 having a composition 2902. In this example, composition 2902 comprises sources B and C and a transition between B and C that occurs between t=12-14. This composition is treated as an individual track or layer. Project 2900 also includes a source A, and a transition between source A and composition 2902 at t=4-8. It will be appreciated that compositions can be much more complicated than the illustrated composition, which is provided for exemplary purposes only. Compositions are useful because they allow the grouping of a particular set of operations on one or more tracks. The operation set is performed on the grouping, and does not affect tracks that are not within the grouping. To draw an analogy, a composition is similar in principle to a mathematical parenthesis. Those operations that appear within the parenthesis are carried out in conjunction with those operations that are intended to operate of the subject matter of the parenthesis. The operations within the parenthesis do not affect tracks that do not appear within the parenthesis.

[0153] In accordance with the processing that is described above in connection with FIG. 19, a first data structure is defined that represents the editing project. FIG. 30 shows an exemplary data structure 3000 in the form of a hierarchical tree structure. In this example, group node 3002 includes two children-track node 3004 and composite node 3006. Track node 3004 is associated with source A. Composite node 3006 includes two children-track nodes 3008 and 3010 that are respectively associated with sources B (3008a) and C (3010a). A transition T2 (3012) is applied on source C and a transition Ti (3014) is applied on composition 3006.

[0154] Next, data structure 3000 is processed to provide a second data structure that is configured to program the matrix switch. Note that as the data structure is being programmed, a matrix switch is being built and configured at the same time. In this example, the second data structure comprises a grid structure that is assembled in much the same way as was described above. There are, however, some differences and, for purposes of understanding, the complete evolution of the grid structure is described here. In the discussion that follows, the completed matrix switch is shown in FIG. 38.

[0155] When the rendering engine initiates the depth-first, left-to-right traversal of data structure 3000, the first node it encounters is track node 3004 which is associated with source A. Thus, a first row of the grid is defined and a grid entry is made that represents the time period for which source A desires to be routed to the matrix switch's primary output pin.

[0156]FIG. 31 shows the state of a grid 3100 after this first processing step. Next the traversal of data structure 3000 encounters the composite node 3006. The composite node is associated with two tracks-track 3008 and track 3010. Track 3008 is associated with source B. Accordingly, a second row of the grid is defined and a grid entry is made that represents the time period for which source B desires to be routed to the matrix switch's primary output pin. Additionally, since B is a member of a composition, meta-information is contained in the grid that indicates that this grid row defines one boundary of the composition. This meta-information is graphically depicted with a bracket that appears to the left of the grid row.

[0157]FIG. 32 shows the state of grid 3100 after this processing step. Next, the traversal of data structure 3000 encounters node 3010 which is associated with source C. Thus, a third row of the grid is added and a grid entry is made that represents the time period for which source C desires to be routed to the matrix switch's primary output pin.

[0158]FIG. 33 shows the state of grid 3100 after this processing step. Notice that the bracket designating the composition now encompasses the grid row associated with source C. The traversal next encounters node 3012 which is the node associated with the second transition T2. Thus, as in the above example, a grid row is added for the transition and a grid entry is made that represents the time period for which the transition desires to be routed to the matrix switch's primary output pin.

[0159]FIG. 34 shows the state of grid 3100 after this processing step. Notice that the bracket designating the composition is now completed and encompasses grid row entries that correspond to sources B and C and the transition between them. Recall from the examples above that a transition, in this example, is programmed to operate on two inputs and provide a single output. In this instance, and because the transition occurs within a composition, the transition is constrained by a rule that does not allow it to operate on any elements outside of the composition. Thus, starting at the transition entry and working backward through the grid, entries at the same tree level and within the composition (as designated by the bracket) are examined to ascertain whether they contain entries that indicate that they want to be routed to the output during the same time that the transition is to be routed to the output. Here, both of the entries for sources B and C have portions that conflict with the transition's entry. Accordingly, those portions of the grid entries for sources B and C are redirected or changed to correspond to output pins that are associated with a transition element that corresponds to transition T2.

[0160]FIG. 35 shows the state of grid 3100 after this processing step. The traversal next encounters node 3014 which is the node that is associated with the transition that occurs between source A and composition 2902 (FIG. 29). Processing of this transition is similar to processing of the transition immediately above except for the fact that the transition does not occur within the composition. Because the transition occurs between the composition and another source, one of the inputs for the transition will be the composition, and one of the inputs will be source A (which is outside of the composition). Thus, a grid row is added for this transition and a grid entry is made that represents the time period for which the transition desires to be routed to the matrix switch's primary output pin.

[0161]FIG. 36 shows the state of grid 3100 after this processing step. At this point then, the grid is examined for entries that conflict with the entry for transition T1. One conflicting grid entry is found for the row that corresponds to source B (inside the composition) and one that corresponds to source A (outside the composition). Accordingly, those portions of the grid row that conflict with transition T1 are changed or redirected to have values that are associated with output pins of the matrix switch that are themselves associated with a transition element T1. In this example, redirection causes an entry of “3” and “4” to be inserted as shown.

[0162]FIG. 37 shows the state of grid 3100 after this processing step. If necessary, a pruning operation would further ensure that the grid has no competing entries for the primary output of the matrix switch. The associated input pin numbers of the matrix switch are shown to the left of grid 3100.

[0163]FIG. 38 shows a suitably configured matrix switch that has been build in accordance with the processing described above. Recall that, as data structure 3000 (FIG. 30) is processed by the rendering engine, a matrix switch is built and configured in parallel with the building and processing of the grid structure that is utilized to program the matrix switch. From the matrix switch and grid 3100 of FIG. 37, the programming of the switch can be easily ascertained.

[0164]FIG. 38a shows an exemplary data structure that represents a project that illustrates the usefulness of composites. In this example, the project can mathematically be represented as follows:

(Fx−noisy (A Tx−Blend B)) Tx−Blend C

[0165] Here, an effect (noisy) is applied to A blended with B, the result of which is applied to a blend with C. The composite in this example allows the grouping of the things beneath it so that the effect (noisy), when it is applied, is applied to everything that is beneath it. Notice that without the composite node, there is no node where an effect can be applied that will affect (A Tx−Blend B). Hence, in this example, operations that appear within the parenthesis are carried out on tracks that appear within the parenthesis. Those operations do not affect tracks that are not within the parenthesis.

[0166]FIG. 39 is a flow diagram that described steps in a method in accordance with one embodiment. The method can be implemented in any suitable hardware, software, firmware, or combination thereof. In the presently-described example, the method is implemented in software. Step 3900 defines a multimedia editing project that includes at least one composite. The composite represents multiple tracks as a single track for purposes of the processing described just below. It is important to note that, in the processing described just below, and because of the use of composites, the extra processing that is required by bounce tracks is avoided (i.e. operating on two tracks, moving the operation result to another location, and retrieving the operation result when later needed). This reduces the processing time that is required to render a multi-media project. Step 3902 defines a first data structure that represents the editing project. Any suitable data structure can be utilized. In the present example, a data structure in the form of a hierarchical tree is utilized. An exemplary tree is shown in FIG. 30. Step 3904 processes the first data structure to provide a second data structure that is configured to program a matrix switch. In the illustrated example, the second data structure comprises a grid structure. Exemplary processing is described in the context of FIGS. 30-37. Step 3906 then programs the matrix switch using the second data structure.

[0167] Video Transitions Represented by Bitmaps

[0168] Transitions from one video to another can be implemented in different ways. One popular way of implementing a transition is through the use of a bitmap and in particular, a gray scale bit map. Although a gray scale bit map is used to illustrate the inventive principles described below, it is to be appreciated that other types of bits maps, e.g. color bit maps, can be used. Typically, gray scale bitmaps, used for transitions, are individually designed by a human designer with the aid of a software application. The use of a gray scale bit map allows one video to visually replace another video in often times creative ways.

[0169]FIG. 40 shows an exemplary gray scale bit map generally at 4000 and a display 4002 that contains two videos 4004 and 4006 that are in the midst of a transition called a “wipe”. In the illustrated wipe effect, video 4006 constitutes the old video and video 4004 constitutes the new video. A boundary line 4008 can be seen between the two videos and is moving to the right. As the boundary line moves to the right, more and more of video 4004 replaces video 4006. To effect this transition, bit map 4000 is used in the following way. Bit map 4000 includes a large number of pixels, e.g. 300×300 or 90,000 pixels. Each pixel is capable of having a value which is one of a predetermined number of gray scale values which represent shades of gray. For example, in this case, assume that there are 256 shades of gray, each ranging in value from 0 (black) to 255 (white). Pixels at the far left of bitmap 4000 have gray scale values that are lower than pixels at the far right of the illustrated bitmap. A programmatic loop is defined such as that illustrated below:

[0170] For Z=0 to 255,

[0171] Walk the picture

[0172] If (color<Z) show the new video, else show the old video

[0173] What this loop does is that it walks through the bitmap for each frame of video. If pixel values in the bitmap are less than Z for a given frame, the new video is shown. If the pixel values for a given frame are greater than Z, then the old video is shown. In the FIG. 40 example, on the first pass (for the first frame), Z=0. Since no pixels are less than 0, the new video is not shown. As Z gets incremented and one proceeds through the bitmap, the new video slides in from the left. Algorithms such as this can be used to implement hundreds of different kinds of effects and transitions, just by changing the bitmap, as will be understood by those of skill in the art.

[0174] As an example of another type of transition that can be implemented using gray scale bit maps, consider FIG. 41. There, a bitmap 4100 in the form of a dark star in the middle, with lighter and lighter stars surrounding the dark star is shown. When this bitmap is used to effect a transition between videos, a small star emerges from the middle of the display and grows in time so that the new video replaces the old video. For example, in display 4102, a new video 4104 is shown replacing old video 4106 and is emerging through a star wipe that is provided by bitmap 4100.

[0175] One of the problems associated with using bitmaps for transitions and effects is that each bitmap must typically be individually designed and configured by a human designer. Thus, in the above example, a human designer was required to design both bitmaps 4000 and 4100. There are instances when it would be convenient and highly economical to assist the human designer with the task of designing bitmaps that are used for video effects. For example, assume that a designer wished to take bitmap 4100 and operate upon it in some manner to provide an entirely new derived bitmap that still has some of the characteristics of bitmap 4100. Until now, the designer would be forced to manually design the new bitmap. In the context of user-defined editing projects, it would be desirable to give the user the ability to change the wipe effect, or the manner in which a bitmap is used or processed to provide a transition or effect. It would be highly desirable to give this user the ability to manipulate transitions and effects while they are editing a project. Consider, for example, FIG. 42 which shows a bit map 4200 that is derived from bitmap 4100. In this instance, bitmap 4200 includes six dark star portions with lighter and lighter stars surrounding each dark star portion. When used to provide a transition, bitmap 4200 provides a display such as that shown at 4202. In the past, bitmap 4202 would have been hand designed by a human designer. Advantageously, this need no longer be the case.

[0176]FIG. 43 shows an exemplary bitmap processor 4300 in accordance with one embodiment. Bitmap processor 4300 can be implemented in any suitable hardware, software, firmware or combination thereof. In the illustrated example, the bitmap processor is implemented as software. Such software can be advantageously employed in connection with and form part of a multi-media project editing application that can allow a user to flexibly create many different types of transitions between video clips.

[0177] The bitmap processor receives as input a bit map which is designated in the drawing as “Old Bitmap”. The processor processes the old bit map and provides, from the old bit map a “New Bitmap”. This can advantageously be done “on the fly” so that a user who is editing a project can have the flexibility to modify, in a robust number of ways, multiple different bit maps that can be used for transitions and effects. The bitmap processor 4300 is configured to implement a number of different operations on a bitmap that it receives. The following operations constitute but exemplary operations and are not intended to be limiting in any way.

[0178] A stretching/shrinking module 4302 is provided and can manipulate a bitmap in different ways. For example, the module can stretch or shrink a bitmap in the x or y dimension. A replication module 4304 can replicate a bitmap any suitable number of times. An offset module 4306 can offset a bitmap. This might be done, for example, if a user wants to start a wipe effect from a different location from where the old bitmap would have originally started it. A border module 4308 is provided and can be used to provide a border, e.g. a blue-colored border, around a wipe effect. The border module does not necessarily change the bitmap itself. Rather, it changes the way in which the bitmap is processed. It will be appreciated that the illustrated modules can be used in various combinations with one another to further enhance the overall flexibility of the system.

[0179]FIG. 44 is a flow diagram that describes steps in a method in accordance with the described embodiment. Portions of this method can be implemented using the system of FIG. 43. Step 4400 receives an original bitmap. Step 4402 operates upon the original bit map to provide a resultant bitmap. Step 4404 uses the resultant bitmap in a transition between different videos. Step 4400 can be implemented by a user selecting a particular bitmap of interest. For example, original bitmaps can be provided by software that provides the multi-media editing software. The user can then be given an opportunity to select certain parameters that can be used to operate upon the original bitmap, e.g. how far to stretch the bitmap, how many times to replicate the bit map, how thick of a border should the bitmap have, and the like.

[0180] Thus, one aspect of the described embodiment provides a user with the ability to select and adjust various parameters that are then used to process an original or old bit map. The selected parameters are imposed on the original bit map to provide a new resultant bitmap that reflects the user's parameter choices. With the new resultant bitmap, transitions can now be implemented between videos that reflect the user's creativity and design.

EXAMPLE

[0181]FIG. 45 shows but one example of how bitmap processor 4300 (FIG. 43) can be used to manipulate or otherwise operate upon an original bitmap. In this example, an original bitmap 4500 is going to be manipulated to provide resultant bitmap 4508. In this example, original and resultant bitmaps 4500, 4508 are dimensionally constrained in that they must be 300×300 pixels, as diagrammatically indicated by box 4502, half of which is occupied with a bitmap that is discussed below.

[0182] Here, bitmap processor 4300 receives the original bit map 4500. The original bitmap defines a dark star with lighter and lighter stars surrounding it. Suppose that a user wishes to use this bitmap, but desires to have a very thin dark star pattern for their transition. They can indicate those wishes by adjusting one or more parameters provided by a UI supported by their multi-media editing software. A simplistic algorithm might simply shrink the bitmap to define a tall thin star and provide the bitmap in an area that is half the width of the desired bitmap dimension. This is diagrammatically indicated by a smaller-dimensioned bitmap within the boundary defined at 4502. This is not very desirable as it leaves a large white area to the right of the bitmap that will be noticeable when the bitmap is used in a transition.

[0183] Alternately, the bitmap processor can do the following. Using the stretching/shrinking module 4302, the processor can take the original 300×300 bitmap 4500 and stretch it to be 300×900 as shown at 4504. Now, since the resultant bitmap must be the same size (i.e. 300×300) as the original bitmap, the center portion 4506 of the resultant bitmap can be clipped and used for the stretched star. Before, however, the clipped portion 4506 can be used as the resultant bit, a rescaling operation is implemented by bitmap processor 4300. Specifically, by removing portions of the resultant stretched bit map (i.e. those portions outside of center portion 4506), gray scale values have likely been discarded as well. Specifically, whereas before there may have been values ranging from 0-255, there may likely be only values ranging from 0-200. Thus, in this embodiment, the bitmap is programmatically operated upon to incorporate all of the 255 gray scale values. This is referred to as a re-scaling operation in which the remaining gray scale values are re-scaled so that all of the predetermined gray scale values are present in the result bitmap that is used for the user-defined transition. The re-scaling operation is desirable because if there are less than the required number of gray scale values, the new picture will be shown too early.

EXAMPLE

[0184]FIG. 46 shows another example of how bitmap processor 4300 (FIG. 43) can be used to manipulate or otherwise operate upon an original bitmap. In this example, an original bitmap 4600 (defining the same star pattern as above) is going to be manipulated to provide resultant bitmap 4602. Resultant bitmap 4602 is the same bitmap as was discussed in connection with FIG. 42. In this example, original and resultant bitmaps 4600, 4602 are dimensionally constrained in that they must be 300×300 pixels, as in the above examples.

[0185] Bitmap processor 4300 first receives an old bitmap that is specified by the user. The user can then specify one or more parameters that are used to process the old bitmap. In this example, the user specifies parameters that cause bitmap 4600 to be copied multiple times and for the multiple copies to be assembled into an intermediate bitmap 4604 having a dimension that is larger than the dimension of bitmap 4600. Thus, if the original bitmap 4600 was a 300×300 bitmap, intermediate bitmap 4604 might be a 900×600 bitmap. To perform the replication operation, bitmap processor uses replication module 4304. Bitmap processor 4300 then uses stretching/shrinking module 4302 to reduce the dimension of intermediate bitmap 4604 so that it is constrained as a 300×300 bitmap as shown at 4602. The bitmap processor 4300 next rescales the resultant bitmap 4602, if necessary, so that a full compliment of gray scale values are present. FIG. 47 is a flow diagram that describes steps in a method in accordance with the above-described embodiment. The method can be implemented in any suitable hardware, software, firmware, or combination thereof. In this example, the method is implemented in software such as bitmap processor 4300. Step 4700 receives one or more parameters provided by a user. The parameters pertain to different ways in which a user can manipulate an original bitmap on the fly. Step 4702 automatically processes a bitmap in accordance with the parameters using a bitmap processor having one or more modules. Each module can process a bitmap differently. Exemplary modules are described above and include, without limitation, a stretching/shrinking module, a replication module, an offset module, and a border module. Step 4702 provides a resultant bitmap and, step 4704 rescales one or more bitmap gray scale values, if necessary, to ensure a full compliment of gray scale values.

[0186] Border Effects

[0187] In accordance with one embodiment, an original or old bitmap can be processed to provide it with a border. For example, FIG. 48 shows a display 4800 having two videos that are being processed in accordance with a bitmap and a border. The exemplary border is shown at 4802. In the described embodiment, bitmap processor 4300 does not change the structure of the original bitmap. Rather, the way in which the original bitmap is processed is somewhat different. Specifically, to produce a border of some thickness t, a solid color or some other pattern is used instead of either new or old video if the value of the pixel in the gray scale bitmap (x) is in a range n−t/2<x<n+t/2. This results in a border that is “t” pixels thick in the transition area.

[0188]FIG. 49 is a flow diagram that describes steps in a method in accordance with an embodiment that provides a border using a gray scale bitmap. The method can be implemented in any suitable hardware, software, firmware, or combination thereof. In this example, the method is implemented in software such as bitmap processor 4300.

[0189] Step 4900 defines a range of values. This step can be implemented by a user entering a range that defines a thickness of a border they desire to create. Step 4902 processes a bitmap. The processing of the bitmap, in this embodiment, can include step 4904 which determines if a bitmap gray scale value is within the defined range. If the bitmap gray scale value is not within the defined range, step 4906 provides old or new video as appropriate. If, however, the bitmap gray scale value is within the defined range, step 4908 provides a border having a thickness that is defined by the user. An exemplary border is shown in FIG. 48. The processing described above describes only one pass. This processing can, of course have multiple passes until the transition is completed.

[0190] Conclusion

[0191] The described embodiments can be used to provide improvements over previous multi-media editing systems. Various efficiencies are achieved that reduce the processing times and can thereby improve the user experience when using multi-media project editing software applications.

[0192] Although the invention has been described in language specific to structural features and/or methodological steps, it is to be understood that the invention defined in the appended claims is not necessarily limited to the specific features or steps described. Rather, the specific features and steps are disclosed as preferred forms of implementing the claimed invention. 

1. A software-implemented video rendering system comprising: a video application configured to enable a user to combine multiple different video clips; and a bitmap processor operatively coupled with the video application and configured to receive a first bitmap that can be used to render a transition between video clips and automatically process the first bitmap to provide a different transition between video clips.
 2. The software-implemented video rendering system of claim 1, wherein the bitmap processor is configured to process the first bitmap to provide a second bitmap that is different from the first bitmap, the second bitmap being configured to render the different transition.
 3. The software-implemented video rendering system of claim 1, wherein the bitmap processor comprises multiple modules each of which being configured to operate upon the first bitmap to provide either or both of (1) a different bitmap or (2) a transition that is different from the transition provided by the first bitmap.
 4. The software-implemented video rendering system of claim 3, wherein one of the modules comprises a shrinking/stretching module that is configured to shrink or stretch, respectively, the first bitmap.
 5. The software-implemented video rendering system of claim 3, wherein one of the modules comprises a replication module that is configured to replicate the first bitmap.
 6. The software-implemented video rendering system of claim 3, wherein one of the modules comprises an offset module that is configured to provide a transition that is offset from a transition provided by the first bitmap.
 7. The software-implemented video rendering system of claim 3, wherein one of the modules comprises a border module that is configured to provide a border in a transition defined by the first bitmap.
 8. The software-implemented video rendering system of claim 3, wherein the one or more modules comprise modules selected from a group consisting of: a shrinking/stretching module that is configured to shrink or stretch, respectively, the first bitmap; a replication module that is configured to replicate the first bitmap; an offset module that is configured to provide a transition that is offset from a transition provided by the first bitmap; and a border module that is configured to provide a border in a transition defined by the first bitmap.
 9. The software-implemented video rendering system of claim 1, wherein the bitmap processor is configured to receive one or more parameters provided by a user and use those parameters to process the first bitmap.
 10. The software-implemented video rendering system of claim 9, wherein the bitmap processor is configured to use the one or more parameters to change the structure of the first bitmap.
 11. Computer-readable media having software code that implements the video rendering system of claim
 1. 12. A method of displaying a video comprising: selecting a bitmap that defines a first transition that can be used to transition between video clips; operating upon the bitmap to provide a second transition that is different from the first transition by using one or more parameters that are provided by a user, the parameters being used to operate upon the bitmap; and effecting the second transition between video clips.
 13. The method of claim 12, wherein said operating comprises providing a second bitmap that is different from the first-mentioned bitmap.
 14. The method of claim 12, wherein said operating comprises stretching the first-mentioned bitmap.
 15. The method of claim 12, wherein said operating comprises shrinking the first-mentioned bitmap.
 16. The method of claim 12, wherein said operating comprises at least one of stretching and shrinking the first-mentioned bitmap.
 17. The method of claim 12, wherein said operating comprises replicating the first-mentioned bitmap.
 18. The method of claim 12, wherein said operating comprises offsetting the first-mentioned bitmap.
 19. The method of claim 12, wherein said operating comprises providing a border that is used in connection with the first-mentioned bitmap to effect the second transition.
 20. The method of claim 12, wherein said operating comprises one or more of: stretching the first-mentioned bitmap; shrinking the first-mentioned bitmap; replicating the first-mentioned bitmap; offsetting the first-mentioned bitmap; and providing a border that is used in connection with the first-mentioned bitmap to effect the second transition.
 21. A video application that is programmed to implement the method of claim
 12. 22. One or more computer-readable media having computer-readable instructions thereon which, when executed by a computer, implement the method of claim
 12. 23. A method of displaying a multi-media editing project comprising: receiving one or more parameters from a user, the parameters being associated with a multi-media editing project and relating to a transition that can be applied between two video clips in the project; selecting a bitmap that defines a first transition that can be used to transition between the video clips; operating upon the bitmap to provide a second transition that is different from the first transition by using the one or more parameters; and effecting the second transition between video clips.
 24. The method of claim 23, wherein said operating comprises providing a second bitmap that is different from the first-mentioned bitmap.
 25. The method of claim 23, wherein said operating comprises one or more of: stretching the first-mentioned bitmap, shrinking the first-mentioned bitmap, replicating the first-mentioned bitmap, offsetting the first-mentioned bitmap, and providing a border that is used in connection with the first-mentioned bitmap to effect the second transition.
 26. The method of claim 23, wherein said receiving comprises receiving parameters that define a range that, in turn, defines a border thickness of a border that is used in connection with the first-mentioned bitmap to effect the second transition.
 27. One or more computer-readable media having computer-readable instructions thereon which, when executed by a computer, cause the computer to: select a first bitmap associated with a transition that can be applied between two video clips in a video editing project; operate upon the first bitmap to provide a second bitmap that is different from the first bitmap by using one or more parameters that are provided by a user, the first bitmap being operated upon by operations comprising one or more of the following operations: stretching, shrinking, replicating, and offsetting; and use the second bitmap in a transition between at least two videos.
 28. A software-implemented method of displaying a multi-media editing project comprising: providing a user interface (UI) through which a user can enter one or more parameters that can be used to manipulate a bitmap-defined transition; receiving one or more parameters that are entered by a user via the UI; selecting a first bitmap associated with the one or more parameters entered by the user; automatically operating upon the bitmap to provide a second bitmap that is different from the first bitmap by using the one or more parameters that are provided by a user, said operating comprising performing one or more of the following operations on the first bitmap: stretching, shrinking, replicating, and offsetting; and using the second bitmap in a transition between at least two videos.
 29. A multi-media project editing application programmed to implement the method of claim
 28. 30. A multi-media project editing system comprising: a software implemented bitmap processor configured for use in connection with a multi-media editing application to effect a transition between different videos, the bitmap processor being configured to: receive one or more parameters from a user; select a first bitmap that is to be used to render a first transition between two videos; operate upon the first bitmap in accordance with the one or more parameters to provide a second transition that is different from the first transition; and apply the transition between two videos.
 31. The multi-media project editing system of claim 30, wherein the bitmap processor operates upon the first bitmap to provide a second bitmap that defines the second transition.
 32. The multi-media project editing system of claim 31, wherein the bitmap processor is configured to rescale the second bitmap so that it contains a predetermined number of gray scale values.
 33. The multi-media project editing system of claim 31, wherein the bitmap processor can operate upon the first bitmap by stretching the first bitmap.
 34. The multi-media project editing system of claim 31, wherein the bitmap processor can operate upon the first bitmap by shrinking the first bitmap.
 35. The multi-media project editing system of claim 31, wherein the bitmap processor can operate upon the first bitmap by stretching or shrinking the first bitmap.
 36. The multi-media project editing system of claim 31, wherein the bitmap processor can operate upon the first bitmap by replicating the first bitmap.
 37. The multi-media project editing system of claim 31, wherein the bitmap processor can operate upon the first bitmap by offsetting the first bitmap.
 38. The multi-media project editing system of claim 30, wherein the bitmap processor can operate upon the first bitmap to provide a border within a transition that is defined by the first bitmap.
 39. A method of displaying a multi-media editing project comprising: selecting a bitmap comprising multiple pixels, each pixel being capable of having one of a number of predetermined of gray scale values, the bitmap being configured for use in effecting a transition between two videos in a multi-media editing project; operating upon the selected bitmap to provide a second bitmap that is different from the first bitmap by using one or more parameters that are provided by a user; resealing the second bitmap to ensure that pixels of the second bit map have, collectively, all of the predetermined gray scale values; and using the second bitmap in a transition between at least two videos.
 40. The method of claim 39 further comprising receiving one or more parameters specified by a user.
 41. The method of claim 39, wherein said operating comprises stretching the selected bitmap.
 42. The method of claim 39, wherein said operating comprises shrinking the selected bitmap.
 43. The method of claim 39, wherein said operating comprises at least one of stretching or shrinking the selected bitmap.
 44. The method of claim 39, wherein said operating comprises replicating the selected bitmap.
 45. The method of claim 39, wherein said operating comprises offsetting the selected bitmap.
 46. The method of claim 39, wherein said operating comprises one or more of: stretching the selected bitmap, shrinking the selected bitmap, replicating the selected bitmap, and offsetting the selected bitmap.
 47. A multi-media project editing application programmed to implement the method of claim
 39. 48. One or more computer-readable media having computer-readable instructions thereon which, when executed by a computer, implement the method of claim
 39. 